Multiple-symbol parallel decoding for variable length codes
نویسندگان
چکیده
منابع مشابه
Parallel Multiple-Symbol Variable-Length Decoding
In this paper, a parallel Variable-Length Decoding (VLD) scheme is introduced. The scheme is capable of decoding all the codewords in an N -bit buffer whose accumulated codelength is at most N . The proposed method partially breaks the recursive dependency related to the MPEG-2 VLD. All possible codewords in the buffer are detected in parallel and the sum of the codelengths is provided to the e...
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملOn Variable Length Codes for Iterative Source/Channel Decoding
We focus on a trellis-based decoding technique for variable length codes (VLCs) which does not require any additional side information besides the number of bits in the coded sequence. A bit-level soft-in/soft-out decoder based on this trellis is used as an outer component decoder in an iterative decoding scheme for a serially concatenated source/channel coding system. In contrast to previous a...
متن کاملAn optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملVariable-length Splittable Codes with Multiple Delimiters
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair’s components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the concatenation of two fixed independent prefix encoding functions applied to the corresponding components of a pair. The codeword of such a sequence of pairs cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2004
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2004.825840